Beyond literal similarity.

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Beyond Literal Similarity

Hitherto, theories of similarity have restricted themselves to judgments of what might be called literal similarity. A central thesis of this article is that a complete account of similarity needs also to be sensitive to nonliteralness, or metaphoricity, an aspect of similarity statements that is most evident in similes but that actually underlies metaphorical language in general. Theoretical a...

متن کامل

Beyond Similarity

Agents that provide just-in-time access to relevant online material by observing user behavior in everyday applications have been the focus of much research, both in our lab, and elsewhere. These systems analyze information objects the user is manipulating in order to recommend additional information. Designers of such systems typically make the assumption that objects similar to the one being ...

متن کامل

Similarity Beyond Distance Measurement

One of the keys issues to content-based image retrieval is the similarity measurement of images. Images are represented as points in the space of low-level visual features and most similarity measures are based on certain distance measurement between these features. Given a distance metric, two images with shorter distance are deemed to more similar than images that are far away. The well-known...

متن کامل

Beyond Pairwise Shape Similarity Analysis

This paper considers two major applications of shape matching algorithms: (a) query-by-example, i. e. retrieving the most similar shapes from a database and (b) finding clusters of shapes, each represented by a single prototype. Our approach goes beyond pairwise shape similarity analysis by considering the underlying structure of the shape manifold, which is estimated from the shape similarity ...

متن کامل

Literal-paraconsistent and literal-paracomplete matrices

We introduce a family of matrices that define logics in which paraconsistency and/or paracompleteness occurs only at the level of literals, that is, formulas that are propositional letters or their iterated negations. We give a sound and complete axiomatization for the logic defined by the class of all these matrices, we give conditions for the maximality of these logics and we study in detail ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Psychological Review

سال: 1979

ISSN: 1939-1471,0033-295X

DOI: 10.1037/0033-295x.86.3.161